Homomorphisms from sparse graphs with large girth
نویسندگان
چکیده
We show that a planar graph with girth at least 20t−2 3 has circular chromatic number at most 2+ 1t , improving earlier results. This follows from a general result establishing homomorphisms into special targets for graphs with given girth and given maximum average degree. Other applications concern oriented chromatic number and homomorphisms into mixed graphs with colored edges.
منابع مشابه
Colorings and girth of oriented planar graphs
Homomorphisms between graphs are studied as a generalization of colorings and of chromatic number. We investigate here homomorphisms from orienta-tions of undirected planar graphs to graphs (not necessarily planar) containing as few digons as possible. We relate the existence of such homomorphisms to girth and it appears that these questions remain interesting even under large girth assumption ...
متن کاملSparse H-Colourable Graphs of Bounded Maximum Degree
Let F be a graph of order at most k. We prove that for any integer g there is a graph G of girth at least g and of maximum degree at most 5k13 such that G admits a surjective homomorphism c to F , and moreover, for any F -pointed graph H with at most k vertices, and for any homomorphism h from G to H there is a unique homomorphism f from F to H such that h = f ◦ c. As a consequence, we prove th...
متن کاملHigh-Girth Graphs Avoiding a Minor are Nearly Bipartite
Let H be a xed graph. We show that any H-minor free graph of high enough girth has a circular-chromatic number arbitrarily close to two. Equivalently, such graphs have homomorphisms into a large odd circuit. In particular, graphs of high girth and of bounded genus or bounded tree width are \nearly bipartite" in this sense. For example, any planar graph of girth at least 16 admits a homomorphism...
متن کاملList coloring the square of sparse graphs with large degree
We consider the problem of coloring the squares of graphs of bounded maximum average degree, that is, the problem of coloring the vertices while ensuring that two vertices that are adjacent or have a common neighbour receive different colors. Borodin et al. proved in 2004 and 2008 that the squares of planar graphs of girth at least seven and sufficiently large maximum degree ∆ are list (∆ + 1)-...
متن کاملThe coloring game on planar graphs with large girth, by a result on sparse cactuses
We denote by χg(G) the game chromatic number of a graph G, which is the smallest number of colors Alice needs to win the coloring game on G. We know from Montassier et al. [M. Montassier, P. Ossona de Mendez, A. Raspaud and X. Zhu, Decomposing a graph into forests, J. Graph Theory Ser. B, 102(1):38-52, 2012] and, independantly, from Wang and Zhang, [Y. Wang and Q. Zhang. Decomposing a planar gr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- J. Comb. Theory, Ser. B
دوره 90 شماره
صفحات -
تاریخ انتشار 2004